Hamiltonian paths with prescribed edges in hypercubesDVORAK, Tomas; GREGOR, Petr.Discrete mathematics. 2007, Vol 307, Num 16, pp 1982-1998, issn 0012-365X, 17 p.Article

On the rate of strong consistency of the total time on test statisticCSÖRGO, M; ZITIKIS, R.Journal of multivariate analysis. 1998, Vol 66, Num 1, pp 99-117, issn 0047-259XArticle

The fault tolerance of NP-hard problemsGLASSER, Christian; PAVAN, A; TRAVERS, Stephen et al.Information and computation (Print). 2011, Vol 209, Num 3, pp 443-455, issn 0890-5401, 13 p.Conference Paper

Hamiltonian cycles with prescribed edges in hypercubesDVORAK, Tomas.SIAM journal on discrete mathematics (Print). 2005, Vol 19, Num 1, pp 135-144, issn 0895-4801, 10 p.Article

SELF-TESTING OF UNIVERSAL AND FAULT-TOLERANT SETS OF QUANTUM GATESVAN DAM, Wim; MAGNIEZ, Frédéric; MOSCA, Michele et al.SIAM journal on computing (Print). 2008, Vol 37, Num 2, pp 611-629, issn 0097-5397, 19 p.Article

A note on an optimal result on fault-tolerant cycle-embedding in alternating group graphsTSAI, Ping-Ying.Information processing letters. 2011, Vol 111, Num 8, pp 375-378, issn 0020-0190, 4 p.Article

Dynamic FTSS in asynchronous systems: The case of unisonDUBOIS, Swan; POTOP-BUTUCARU, Maria; TIXEUIL, Sébastien et al.Theoretical computer science. 2011, Vol 412, Num 29, pp 3418-3439, issn 0304-3975, 22 p.Article

Combinatorial constructions of fault-tolerant routings with levelled minimum optical indicesXIANDE ZHANG; GENNIAN GE.Discrete applied mathematics. 2010, Vol 158, Num 8, pp 951-963, issn 0166-218X, 13 p.Article

Edge-fault-tolerant diameter and bipanconnectivity of hypercubesCHEN, Xie-Bin.Information processing letters. 2010, Vol 110, Num 24, pp 1088-1092, issn 0020-0190, 5 p.Article

FAST ACCESS TO DISTRIBUTED ATOMIC MEMORYDUTTA, Partha; GUERRAOUI, Rachid; LEVY, Ron R et al.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3752-3783, issn 0097-5397, 32 p.Article

A note on atomicity : Boosting Test&Set to solve consensusIMBS, Damien; RAYNAL, Michel.Information processing letters. 2009, Vol 109, Num 12, pp 589-591, issn 0020-0190, 3 p.Article

A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networksTZENG, Chi-Hung; JIANG, Jehn-Ruey; HUANG, Shing-Tsaan et al.Information processing letters. 2009, Vol 109, Num 10, pp 518-522, issn 0020-0190, 5 p.Article

An optimal result on fault-tolerant cycle-embedding in alternating group graphsXUE, Zhan-Jun; LIU, San-Yang.Information processing letters. 2009, Vol 109, Num 21-22, pp 1197-1201, issn 0020-0190, 5 p.Article

Of malicious motes and suspicious sensors On the efficiency of malicious interference in wireless networksGILBERT, Seth; GUERRAOUI, Rachid; NEWPORT, Calvin et al.Theoretical computer science. 2009, Vol 410, Num 6-7, pp 546-569, issn 0304-3975, 24 p.Article

On approximate optimal dual power assignment for biconnectivity and edge-biconnectivityCHEN WANG; PARK, Myung-Ah; WILLSON, James et al.Theoretical computer science. 2008, Vol 396, Num 1-3, pp 180-190, issn 0304-3975, 11 p.Article

Panconnectivity and edge-pancyclicity of faulty recursive circulant G(2^m, 4)PARK, Jung-Heum.Theoretical computer science. 2008, Vol 390, Num 1, pp 70-80, issn 0304-3975, 11 p.Article

Statistical Certification of Software SystemsDI BUCCHIANICO, Alessandro; FRISO GROOTE, Jan; VAN HEE, Kees et al.Communications in statistics. Simulation and computation. 2008, Vol 37, Num 1-2, pp 346-359, issn 0361-0918, 14 p.Article

HAMMING CODES, HYPERCUBE EMBEDDINGS, AND FAULT TOLERANCEAIELLO, William; LEIGHTON, F. T.SIAM journal on computing (Print). 2008, Vol 37, Num 3, pp 783-803, issn 0097-5397, 21 p.Article

Document Scanning in a tough environment: application to cameraphonesSAOUD, Sahar; MAHANI, Zouhir; HAKIM, Abdelilah et al.International journal of imaging and robotics. 2013, Vol 9, Num 1, pp 1-16, 16 p.Article

Hamiltonian properties of twisted hypercube-like networks with more faulty elementsXIAOFAN YANG; QIANG DONG; ERJIE YANG et al.Theoretical computer science. 2011, Vol 412, Num 22, pp 2409-2417, issn 0304-3975, 9 p.Article

A simple and communication-efficient Omega algorithm in the crash-recovery modelMARTIN, Cristian; LARREA, Mikel.Information processing letters. 2010, Vol 110, Num 3, pp 83-87, issn 0020-0190, 5 p.Article

Cycles passing through a prescribed path in a hypercube with faulty edgesCHEN, Xie-Bin.Information processing letters. 2010, Vol 110, Num 16, pp 625-629, issn 0020-0190, 5 p.Article

FAULT-TOLERANT QUANTUM COMPUTATION WITH CONSTANT ERROR RATEAHARONOV, Dorit; BEN-OR, Michael.SIAM journal on computing (Print). 2009, Vol 38, Num 4, pp 1207-1282, issn 0097-5397, 76 p.Article

On f-fault tolerant arc-forwarding and optical indices of all-optical folded hypercubesMEIRUN CHEN; JIANGUO QIAN.Information processing letters. 2009, Vol 109, Num 15, pp 828-831, issn 0020-0190, 4 p.Article

PARTITIONS OF FAULTY HYPERCUBES INTO PATHS WITH PRESCRIBED ENDVERTICESDVORAK, Tomáš; GREGOR, Petr.SIAM journal on discrete mathematics (Print). 2009, Vol 22, Num 4, pp 1448-1461, issn 0895-4801, 14 p.Article